- strongly disjoint sets
- сильно непересекающиеся множества
English-Russian scientific dictionary. 2008.
strongly disjoint sets
Смотреть что такое "strongly disjoint sets" в других словарях:
Constructible universe — Gödel universe redirects here. For Kurt Gödel s cosmological solution to the Einstein field equations, see Gödel metric. In mathematics, the constructible universe (or Gödel s constructible universe), denoted L, is a particular class of sets… … Wikipedia
Graph (mathematics) — This article is about sets of vertices connected by edges. For graphs of mathematical functions, see Graph of a function. For statistical graphs, see Chart. Further information: Graph theory A drawing of a labeled graph on 6 vertices and 7 edges … Wikipedia
logic, history of — Introduction the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic There was a medieval tradition according to which the Greek philosopher … Universalium
Symbolic combinatorics — in mathematics is a technique of analytic combinatorics that uses symbolic representations of combinatorial classes to derive their generating functions. The underlying mathematics, including the Pólya enumeration theorem, are explained on the… … Wikipedia
Dempster-Shafer theory — The Dempster Shafer theory is a mathematical theory of evidenceShafer, Glenn; A Mathematical Theory of Evidence , Princeton University Press, 1976, ISBN 0 608 02508 9] based on belief functions and plausible reasoning , which is used to combine… … Wikipedia
Dempster–Shafer theory — Prof Arthur P. Dempster at the workshop on Belief Function Theory (Brest 1 april 2010). The Dempster–Shafer theory (DST) is a mathematical theory of evidence.[1] It allows … Wikipedia
Alias analysis — is a technique in compiler theory, used to determine if a storage location may be accessed in more than one way. Two pointers are said to be aliased if they point to the same location. Alias analysis techniques are usually classified by flow… … Wikipedia
Ethernet — An 8P8C modular connector (often called RJ45) commonly used on cat 5 cables in Ethernet networks Ethernet … Wikipedia
Fundamental modeling concepts — (FMC) provide a framework to describe software intensive systems. It strongly emphasizes the communication about software intensive systems by using a semi formal graphical notation that can easily be understood. Introduction FMC distinguishes… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
